Parallel Adaptively Re ned Sparse

Fast , Adaptively Re ned ComputationalElements in 3

Multiresolution Representation and Reconstruction of Adaptively Sampled Images

We present a method for sampling, structuring and reconstructing progressively re ned images e ectively. This has direct applications to progressive re nement of the result of slow renderers, such as ray tracers, and to the progressive transmission of images on slow media, as in world wide web browsers. Sampling images adaptively with respect to frequency at the back end provides a more compact...

A numerical study of a posteriori error estimators for convection±diusion equations

This paper presents a numerical study of a posteriori error estimators for convection±di€usion equations. The study involves the gradient indicator, an a posteriori error estimator which is based on gradient recovery, three residual-based error estimators for di€erent norms, and two error estimators which are de®ned by solutions of local Neumann problems. They are compared with respect to the r...

Compiling Parallel Sparse Code for User � De ned Data

We describe how various sparse matrix and distribution formats can be handled using the relational approach to sparse matrix code compilation This approach allows for the development of compilation techniques that are independent of the storage formats by viewing the data structures as relations and abstracting the implementation details as access methods Introduction Sparse matrix computations...

Interpolatory Subdivision on Open Quadrilateral Nets with Arbitrary Topology

A simple interpolatory subdivision scheme for quadrilateral nets with arbitrary topology is presented which generates C 1 surfaces in the limit. The scheme satis es important requirements for practical applications in computer graphics and engineering. These requirements include the necessity to generate smooth surfaces with local creases and cusps. The scheme can be applied to open nets in whi...